On two-stage convex chance constrained problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CORC Technical Report TR-2005-06 On two-stage convex chance constrained problems

In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [18] formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f(x,h) is bi-affine. We show that this algorithm extends to bi-convex f(x,h) in a fairly straightforward fashion. The complexity of the s...

متن کامل

Convex relaxations of chance constrained optimization problems

In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...

متن کامل

On distributionally robust joint chance-constrained problems

Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...

متن کامل

Decomposition algorithms for two-stage chance-constrained programs

We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility...

متن کامل

Convex Chance Constrained Predictive Control without Sampling

In this paper we consider finite-horizon predictive control of dynamic systems subject to stochastic uncertainty; such uncertainty arises due to exogenous disturbances, modeling errors, and sensor noise. Stochastic robustness is typically defined using chance constraints, which require that the probability of state constraints being violated is below a prescribed value. Prior work showed that i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods of Operations Research

سال: 2006

ISSN: 1432-2994,1432-5217

DOI: 10.1007/s00186-006-0104-2